The Complexity of Boolean Constraint Isomorphism
نویسندگان
چکیده
We consider the Boolean constraint isomorphism problem, that is, the problem of determining whether two sets of Boolean constraint applications can be made equivalent by renaming the variables. We show that depending on the set of allowed constraints, the problem is either coNP-hard and GI-hard, equivalent to graph isomorphism, or polynomial-time solvable. This establishes a complete classification of the complexity of the problem, and moreover, it identifies exactly all those cases in which Boolean constraint isomorphism is polynomial-time manyone equivalent to graph isomorphism, the best-known and best-examined isomorphism problem in theoretical computer science.
منابع مشابه
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem
Schaefer proved in 1978 that the Boolean constraint satisfaction problem for a given constraint language is either in P or is NPcomplete, and identified all tractable cases. Schaefer’s dichotomy theorem actually shows that there are at most two constraint satisfaction problems, up to polynomial-time isomorphism (and these isomorphism types are distinct if and only if P 6= NP). We show that if o...
متن کاملEquivalence and Isomorphism for Boolean Constraint Satisfaction
A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set C of Boolean functions. We consider the problem of determining whether two given constraint satisfaction instances are equivalent and prove a Dichotomy Theorem by showing that for all sets C of allowed constraints, this problem is either polynomial-tim...
متن کامل2 00 4 Isomorphic Implication ∗
We study the isomorphic implication problem for Boolean constraints. We show that this is a natural analog of the subgraph isomorphism problem. We prove that, depending on the set of constraints, this problem is in P, NP-complete, or NP-hard, coNP-hard, and in P || . We show how to extend the NP-hardness and coNP-hardness to P || -hardness for some cases, and conjecture that this can be done in...
متن کاملLower Bounds for Heuristic Algorithms
The constraint satisfaction problem, the Boolean satisfiability problem and the graph isomorphism problem do not have efficient algorithms. In order to solve these problems, one utilizes heuristic algorithms of polynomial running time. The present thesis studies three classical heuristics for the above-mentioned decision problems and answers the question whether they can be implemented more eff...
متن کاملThe Complexity of Boolean Matrix Root Computation
We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as directed graphs, we further reveal a connection between Boolean matrix roots and graph isomorphism, which leads to a proof that for a certain subclass of Boolean matrices related to subdivision digraphs, root finding is of the same ...
متن کامل